|
In computational geometry, a Pitteway triangulation is a point set triangulation in which the nearest neighbor of any point ''p'' within the triangulation is one of the vertices of the triangle containing ''p''. Alternatively, it is a Delaunay triangulation in which each internal edge crosses its dual Voronoi diagram edge. Pitteway triangulations are named after Michael Pitteway, who studied them in 1973. Not every point set supports a Pitteway triangulation. When such a triangulation exists it is a special case of the Delaunay triangulation, and consists of the union of the Gabriel graph and convex hull. ==History== The concept of a Pitteway triangulation was introduced by . See also , who writes "An optimal partition is one in which, for any point within any triangle, that point lies at least as close to one of the vertices of that triangle as to any other data point." The name "Pitteway triangulation" was given by . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Pitteway triangulation」の詳細全文を読む スポンサード リンク
|